Modeling complex networks with self-similar outerplanar unclustered graphs
نویسندگان
چکیده
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the graphs are outerplanar and it is know that many algorithms that are NP-complete for general graphs perform polynomial in outerplanar graphs. Therefore the graphs constitute a good mathematical model for these systems.
منابع مشابه
Planar unclustered graphs to model technological and biological networks
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases usually associated with topological restrictionstheir clustering is low and they are almost planar. In this paper we introduce a family of graphs which share all the...
متن کاملThe Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning tr...
متن کاملStructure And Properties Of Locally Outerplanar Graphs
This paper studies convex geometric graphs in which no path of length 3 self-intersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set in terms of the number of vertices and the number and type of graphs in the decomposition. The paper als...
متن کاملA self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs
Self-stabilizing algorithms model distributed systems and allow automatic recovery of the system from transient failures. The center of a graph is the set of vertices with the minimum eccentricity. In this paper we investigate the self-stabilizing algorithm for finding the center of Cartesian product of K2 and maximal outerplanar graphs.
متن کاملL(h, 1)-labeling subclasses of planar graphs
L(h, 1)-labeling, h = 0, 1, 2, is a class of coloring problems arising from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least h apart while nodes connected by a two long path must receive different colors. This problem is NP-complete even when limited to planar graphs. Here, we focus on L(h, 1)-labeling restricted to regular tilings of the pla...
متن کامل